Computation of Galois groups over function fields
نویسندگان
چکیده
Symmetric function theory provides a basis for computing Galois groups which is largely independent of the coefficient ring. An exact algorithm has been implemented over Q(t1, t2, . . . , tm) in Maple for degree up to 8. A table of polynomials realizing each transitive permutation group of degree 8 as a Galois group over the rationals is included.
منابع مشابه
Selmer groups and Mordell-Weil groups of elliptic curves over towers of function fields
In [12] and [13], Silverman discusses the problem of bounding the Mordell-Weil ranks of elliptic curves over towers of function fields. We first prove generalizations of the theorems of those two papers by a different method, allowing non-abelian Galois groups and removing the dependence on Tate’s conjectures. We then prove some theorems about the growth of Mordell-Weil ranks in towers of funct...
متن کاملMath 121 Notes: a Field Guide to Galois Theory
1. Vector Spaces: 1/7/13 1 2. Review of Math 120 I: Planting Seeds: 1/9/13 3 3. Review of Math 120 II: Harvesting Consequences: 1/11/13 4 4. Extending Fields by Adjoining Roots of Irreducible Polynomials: 1/14/13 5 5. Splitting Fields and Algebraic Closures: 1/16/13 6 6. Searching for Closure: 1/18/13 7 7. Separable Field Extensions: 1/23/13 9 8. Finite Fields and Roots of Unity: 1/25/13 10 9. ...
متن کاملResultants, Resolvents and the Computation of Galois Groups
We will develop the machinery of resultants and resolvent polynomials with the ultimate goal of understanding the so-called “resolvent method” for computing Galois groups over Q. Along the way, we will encounter tangential applications of these tools, such as the determination of the minimal polynomial of, say, the sum of two algebraic numbers using resultants. In this way, this paper can serve...
متن کاملMulti-parameter Polynomials with Given Galois Group
The non-Abelian finite simple groups and their automorphism groups play a crucial role in an inductive approach to the inverse problem of Galois theory. The rigidity method (see, for example, Malle and Matzat, 1999) has proved very efficient for deducing the existence of Galois extensions with such groups, as well as for the construction of polynomials generating such extensions. Nevertheless, ...
متن کاملTechniques for the Computation of Galois Groups
This note surveys recent developments in the problem of computing Galois groups. Galois theory stands at the cradle of modern algebra and interacts with many areas of mathematics. The problem of determining Galois groups therefore is of interest not only from the point of view of number theory (for example see the article [39] in this volume), but leads to many questions in other areas of mathe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 66 شماره
صفحات -
تاریخ انتشار 1997